Mutual Service Processes in R Existence and Ergodicity
نویسندگان
چکیده
Consider a set of objects, abstracted to points of a spatially stationary point process in R, that deliver mutually each other a service at a rate depending on their distance. Assume that the points arrive as a Poisson process and leave when their service requirements have been fulfilled. We show how such a process can be constructed and establish its ergodicity under fairly general conditions. We also establish a hierarchy of balance integral relations between the factorial moment measures and show that the time-stationary process exhibits a repulsivity property. AMS Classification: 60D05, 60G55, 60D05, 60G10, 60G17, 60J25, 05C80, 70F45.
منابع مشابه
On $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes
In the present paper we investigate the $L_1$-weak ergodicity of nonhomogeneous continuous-time Markov processes with general state spaces. We provide a necessary and sufficient condition for such processes to satisfy the $L_1$-weak ergodicity. Moreover, we apply the obtained results to establish $L_1$-weak ergodicity of quadratic stochastic processes.
متن کاملOn Markov-switching ARMA processes – stationarity, existence of moments and geometric ergodicity
The probabilistic properties of R-valued Markov-Switching ARMA processes with a general state space parameter chain are analysed. Stationarity and ergodicity conditions are given and a feasible general stationarity condition based on a tailor-made norm is introduced. Moreover, it is shown that causality of all individual regimes is neither a necessary nor a sufficient criterion for strict negat...
متن کاملOn Hidden Markov Processes with Infinite Excess Entropy
We investigate stationary hidden Markov processes for which mutual information between the past and the future is infinite. It is assumed that the number of observable states is finite and the number of hidden states is countably infinite. Under this assumption, we show that the block mutual information of a hidden Markov process is upper bounded by a power law determined by the tail index of t...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA general definition of conditional information and its application to ergodic decomposition∗
We discuss a simple definition of conditional mutual information (CMI) for fields and σ-fields. The new definition is applicable also in nonregular cases, unlike the well-known but more restricted definition of CMI by Dobrushin. Certain properties of the two notions of CMI and their equivalence for countably generated σ-fields are established. We also consider an application, which concerns the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015